Java program to check if the given number is Prime?

Question

Krishnapriya Rajeev · Answer

Given below is the code to check if a given number is prime or not.
class prime{
  public static void main(String args[]){
    int n = 139;
    if(isPrime(n)){
    System.out.println(n+" is prime.");
  }
    else{
      System.out.println(n+" is not prime");
    }
  }
  //Function to check if a number is prime or not
  static boolean isPrime(int n){
    int mid = n/2;
    if(n == 0 || n == 1){
      return false;
    }
    for(int i = 2; i andlt;= mid; i++){
      if(n%i == 0){
        return false; //Returns false if the number is divisible by any number
      }
    }
     return true; //Returns true if the number is not divisible by any other number other than 1 and the number itself
  }
}
OUTPUT
139 is prime
and

Mukul Goenka · Answer

public class PrimeNumberCheck {
and public static void main(String[] args) {
and  System.out.println(isPrime(19)); // true
and  System.out.println(isPrime(49)); // false
and }
and public static boolean isPrime(int n) {
and  if (n == 0 || n == 1) {
and  and return false;
and  }
and  if (n == 2) {
and  and return true;
and  }
and  for (int i = 2; i andlt;= n / 2; iand#43;and#43;) {
and  and if (n % i == 0) {
and  and  return false;
and  and }
and  }
and  return true;
and }
}
Output.
true 
false

forum

Java program to check if the given number is Prime?

Mukul Goenka

Can you answer this question?

2 Answers

Liked By